ct 2 00 3 Byzantine Agreements in Secure Communication
نویسنده
چکیده
Byzantine Agreements were first formally proposed by Lamport [8], for use in finding faulty processors in distrubuted computer networks. In this article we will use the process of finding faults to uncover traitors in secure communications networks. Maintaining reliability in trusted networks is an important application of Byzantine Agreements. Thus by introducing the fundamentals of the Byzantine Generals problem and its generalized Agreement protocol we will establish a game theoretic solution to the cryptographic problem of secure communications networks.
منابع مشابه
Byzantine Agreements in Secure Communication
Byzantine Agreements were first formally proposed by Lamport [8], for use in finding faulty processors in distrubuted computer networks. In this article we will use the process of finding faults to uncover traitors in secure communications networks. Maintaining reliability in trusted networks is an important application of Byzantine Agreements. Thus by introducing the fundamentals of the Byzant...
متن کاملFinding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors in such networks. We use the original concept of the Byzantine Generals Problem by Lamport [7], and the more formal Byzantine Agreement describe by Linial [9], to find traitors in secure networks. By applying general f...
متن کامل6.857 - Final Project Secure Transactions without Mining or Central Authority
In our project we implemented a system from transferring money without using Proof-of-Work, but consensus algorithms. First we implemented it using Paxos[11], that does not support Byzantine failures and needs a central authority to decide which nodes participate on the agreements. Then we reimplemented it using Stellar Consensus Protocol[2], that has no central authority and allows Byzantine n...
متن کاملMulti-valued Byzantine Broadcast: The t < n Case
Byzantine broadcast is a distributed primitive that allows a specific party to consistently distribute a message among n parties in the presence of potential misbehavior of up to t of the parties. All known protocols implementing broadcast of an `-bit message from point-to-point channels tolerating any t < n Byzantine corruptions have communication complexity at least Ω(`n). In this paper we gi...
متن کاملSecure Communication in Multicast Graphs
In this paper we solve the problem of secure communication in multicast graphs, which has been open for over a decade. At Eurocrypt ’98, Franklin and Wright initiated the study of secure communication against a Byzantine adversary on multicast channels in a neighbor network setting. Their model requires node-disjoint and neighbor-disjoint paths between a sender and a receiver. This requirement ...
متن کامل